A Dense Packing of Regular Tetrahedra

We construct a dense packing of regular tetrahedra, with packing density $D > >.7786157$.Comment: full color versio

Lattice-point enumerators of ellipsoids

Minkowski's second theorem on successive minima asserts that the volume of a 0-symmetric convex body K over the covolume of a lattice \Lambda can be bounded above by a quantity involving all the successive minima of K with respect to \Lambda. We will prove here that the number of lattice points inside K can also accept an upper bound of roughly the same size, in the special case where K is an ellipsoid. Whether this is also true for all K unconditionally is an open problem, but there is reasonable hope that the inductive approach used for ellipsoids could be extended to all cases.Comment: 9 page

Collaborative Delivery with Energy-Constrained Mobile Robots

We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a limited energy which constrains the distance it can move. Hence multiple agents need to collaborate to move the message, each agent handing over the message to the next agent to carry it forward. Given the positions of the agents in the graph and their respective budgets, the problem of finding a feasible movement schedule for the agents can be challenging. We consider two variants of the problem: in non-returning delivery, the agents can stop anywhere; whereas in returning delivery, each agent needs to return to its starting location, a variant which has not been studied before. We first provide a polynomial-time algorithm for returning delivery on trees, which is in contrast to the known (weak) NP-hardness of the non-returning version. In addition, we give resource-augmented algorithms for returning delivery in general graphs. Finally, we give tight lower bounds on the required resource augmentation for both variants of the problem. In this sense, our results close the gap left by previous research.Comment: 19 pages. An extended abstract of this paper was published at the 23rd International Colloquium on Structural Information and Communication Complexity 2016, SIROCCO'1

Outbreak of tropical rat mite (Ornithonyssus bacoti) dermatitis in a home for disabled persons

Five mentally handicapped individuals living in a home for disabled persons in Southern Germany were seen in our outpatient department with pruritic, red papules predominantly located in groups on the upper extremities, neck, upper trunk and face. Over several weeks 40 inhabitants and 5 caretakers were affected by the same rash. Inspection of their home and the sheds nearby disclosed infestation with rat populations and mites. Finally the diagnosis of tropical rat mite dermatitis was made by the identification of the arthropod Ornithonyssus bacoti or so-called tropical rat mite. The patients were treated with topical corticosteroids and antihistamines. After elimination of the rats and disinfection of the rooms by a professional exterminator no new cases of rat mite dermatitis occurred. The tropical rat mite is an external parasite occurring on rats, mice, gerbils, hamsters and various other small mammals. When the principal animal host is not available, human beings can become the victim of mite infestation. Copyright (c) 2007 S. Karger AG, Base

Multi-resolution image analysis for vehicle detection

Proceeding of: Second Iberian Conference, IbPRIA 2005, Estoril, Portugal, June 7-9, 2005Computer Vision can provide a great deal of assistance to Intelligent Vehicles. In this paper an Advanced Driver Assistance Systems for Vehicle Detection is presented. A geometric model of the vehicle is defined where its energy function includes information of the shape and symmetry of the vehicle and the shadow it produces. A genetic algorithm finds the optimum parameter values. As the algorithm receives information from a road detection module some geometric restrictions can be applied. A multi-resolution approach is used to speed up the algorithm and work in realtime. Examples of real images are shown to validate the algorithm.Publicad

Differential Localization of G Protein βγ Subunits

G protein βγ subunits play essential roles in regulating cellular signaling cascades, yet little is known about their distribution in tissues or their subcellular localization. While previous studies have suggested specific isoforms may exhibit a wide range of distributions throughout the central nervous system, a thorough investigation of the expression patterns of both Gβ and Gγ isoforms within subcellular fractions has not been conducted. To address this, we applied a targeted proteomics approach known as multiple-reaction monitoring to analyze localization patterns of Gβ and Gγ isoforms in pre- and postsynaptic fractions isolated from cortex, cerebellum, hippocampus, and striatum. Particular Gβ and Gγ subunits were found to exhibit distinct regional and subcellular localization patterns throughout the brain. Significant differences in subcellular localization between pre- and postsynaptic fractions were observed within the striatum for most Gβ and Gγ isoforms, while others exhibited completely unique expression patterns in all four brain regions examined. Such differences are a prerequisite for understanding roles of individual subunits in regulating specific signaling pathways throughout the central nervous system

OpenFraming: we brought the ML; you bring the data. Interact with your data and discover its frames

When journalists cover a news story, they can cover the story from multiple angles or perspectives. A news article written about COVID-19 for example, might focus on personal preventative actions such as mask-wearing, while another might focus on COVID-19's impact on the economy. These perspectives are called "frames," which when used may influence public perception and opinion of the issue. We introduce a Web-based system for analyzing and classifying frames in text documents. Our goal is to make effective tools for automatic frame discovery and labeling based on topic modeling and deep learning widely accessible to researchers from a diverse array of disciplines. To this end, we provide both state-of-the-art pre-trained frame classification models on various issues as well as a user-friendly pipeline for training novel classification models on user-provided corpora. Researchers can submit their documents and obtain frames of the documents. The degree of user involvement is flexible: they can run models that have been pre-trained on select issues; submit labeled documents and train a new model for frame classification; or submit unlabeled documents and obtain potential frames of the documents. The code making up our system is also open-sourced and well-documented, making the system transparent and expandable. The system is available on-line at http://www.openframing.org and via our GitHub page https://github.com/davidatbu/openFraming .Published versio

Valuations on lattice polytopes

This survey is on classification results for valuations defined on lattice polytopes that intertwine the special linear group over the integers. The basic real valued valuations, the coefficients of the Ehrhart polynomial, are introduced and their characterization by Betke and Kneser is discussed. More recent results include classification theorems for vector and convex body valued valuations. © Springer International Publishing AG 2017